Combining Finite Automata, Parallel Programs and SDL Using Petri Nets

This paper introduces a method to combine nite automata, parallel programs and SDL (Speciication and Description Language) speciications. We base our approach on M-nets exploiting the rich set of composition operators available in this algebra of high-level Petri nets. In order to be able to combine diierent modelling techniques, we rely on compatible interfaces. Therefore, { we extend an existing semantics, namely the M-net semantics for the parallel programming language B(PN) 2 ; and { we present an M-net semantics for nite automata. Considering the hybrid modelling of an ARQ (Automatic Repeat reQuest) protocol, we show how the diierent formalisms t together as well as the resulting veriication possibilities. As a side-eeect we describe ongoing development of the PEP tool (Programming Environment based on Petri Nets). As a consequence of our approach we are introducing a hierarchicaìprogramming with nets' method which is currently implemented in the high-level Petri net editor of the tool.